Phrase Prioritization Algorithm and Supporting Data Structure for Retrieval

In the heart of this research work lies the proposed algorithm, which prioritizes the phrases of the search queries. This algorithm suggests the methodology of fetching phrases and then searching all possible phrases, so that recall value can be increased. The most important issue in this regard is the usage of such data structure, which facilitates the efficient search of phrases in documents. For this purpose, Linked Representation of Sparse Matrix has been suggested, which consists of linked lists not only rowwise but also columnwise. Columns correspond to the documents and hence make the search of every possible phrase efficient. Rows correspond to the dictionary of words. Linked Representation maintain the dynamic nature of documents as well as insertion and deletion of words from the documents.